NiMo syntax: part 1

Many formalisms for the specification for concurrent and distributed systems have emerged. In particular considering boxes and strings approaches. Examples are action calculi, rewriting logic and graph rewriting, bigraphs. The boxes and string metaphor is addressed with different levels of granularity. One of the approaches is to consider a process network as an hypergraph. Based in this general framework, we encode NiMo nets as a class of Annotated hypergraphs. This class is defined by giving the alphabet and the operations used to construct such programs. Therefore we treat only editing operations on labelled hypergraphs and afterwards how this editing operation affects the graph. Graph transformation (execution rules) is not covered here.Postprint (published version

NiMoToons: a totally graphic workbench for program tuning and experimentation

NiMo (Nets In Motion) is a Graphic-Functional-Data Flow language designed to visualize algorithms and their execution in an understandable way. Programs are process networks that evolve showing the full state at each execution step. Processes are polymorphic, higher order and have multiple outputs. The language has a set of primitive processes well suited for stream programming and supports open programs and interactive debugging. The new version of the environment NiMo Toons includes: an also graphic and incremental type inference system, multiple output processes as higher order parameters, symbolic execution, five evaluation modes that can be globally or locally set for each process and dynamically changed, and facilities to measure the used resources (parallelism level, number of steps, number of processes, etc.)Postprint (author’s final draft

ElevationSys

ElevationSys es un sistema de gestión web para el proceso de producción de una empresa de ascensores. El sistema contiene diferentes tipos de usuarios de los departamentos de la empresa y esta administrado por unos flujos con relación de dependencia que van marcando el ritmo del trabajo. Este backOffice está pensado para abarcar todo el procedimiento de la fábrica, desde que se presenta la oferta al cliente hasta que se entrega la máquina.ElevationSys és un sistema de gestió web per al procés de producció d'una empresa d'ascensors. El sistema conté diferents tipus d'usuaris dels departaments de l'empresa i està administrat per uns fluxos en relació de dependència que van marcant el ritme de la feina. Aquest BackOffice està pensat per abastar tot el procedimient de la fàbrica, des que es presenta l'oferta al client fins que es lliura la màquina.ElevationSys is a web management system for the production process of an elevator company. The system contains different types of users from the departments of the company and is administered by a relation of dependence flows that are setting the pace of work. The BackOffice is designed to cover the whole process of the factory, from the offer presented to the client until the machine is delivered

ElevationSys

ElevationSys es un sistema de gestión web para el proceso de producción de una empresa de ascensores. El sistema contiene diferentes tipos de usuarios de los departamentos de la empresa y esta administrado por unos flujos con relación de dependencia que van marcando el ritmo del trabajo. Este backOffice está pensado para abarcar todo el procedimiento de la fábrica, desde que se presenta la oferta al cliente hasta que se entrega la máquina.ElevationSys és un sistema de gestió web per al procés de producció d'una empresa d'ascensors. El sistema conté diferents tipus d'usuaris dels departaments de l'empresa i està administrat per uns fluxos en relació de dependència que van marcant el ritme de la feina. Aquest BackOffice està pensat per abastar tot el procedimient de la fàbrica, des que es presenta l'oferta al client fins que es lliura la màquina.ElevationSys is a web management system for the production process of an elevator company. The system contains different types of users from the departments of the company and is administered by a relation of dependence flows that are setting the pace of work. The BackOffice is designed to cover the whole process of the factory, from the offer presented to the client until the machine is delivered

Graphical and incremental type inference: a graph transformation approach

We present a graph grammar based type inference system for a totally graphic development language. NiMo (Nets in Motion) can be seen as a graphic equivalent to Haskell that acts as an on-line tracer and debugger. Programs are process networks that evolve giving total visibility of the execution state, and can be interactively completed, changed or stored at any step. In such a context, type inference must be incremental. During the net construction or modification only type safe connections are allowed. The user visualises the type information evolution and, in case of conflict, can easily identify the causes. Though based on the same ideas, the type inference system has significant differences with its analogous in functional languages. Process types are a non-trivial generalization of functional types to handle multiple outputs, partial application in any order, and curried-uncurried coercion. Here we present the elements to model graphical inference, the notion of structural and non-structural equivalence of type graphs, and a graph unification and composition calculus for typing nets in an incremental way

NiMo syntax: part 1

Many formalisms for the specification for concurrent and distributed systems have emerged. In particular considering boxes and strings approaches. Examples are action calculi, rewriting logic and graph rewriting, bigraphs. The boxes and string metaphor is addressed with different levels of granularity. One of the approaches is to consider a process network as an hypergraph. Based in this general framework, we encode NiMo nets as a class of Annotated hypergraphs. This class is defined by giving the alphabet and the operations used to construct such programs. Therefore we treat only editing operations on labelled hypergraphs and afterwards how this editing operation affects the graph. Graph transformation (execution rules) is not covered here